Irreducible polynomials with many roots of maximal modulus
نویسندگان
چکیده
منابع مشابه
Roots and Irreducible Polynomials
This handout, which accompanies the course on analogies between Z and F [T ], discusses some properties of polynomials in F [T ]. The results in Sections 1 and 2 work with any F , but the results in Section 3 and 4 are (somewhat) special to the field F = Fp. The main result in these notes in Theorem 3.7. The notation F [T ]h(T ), for the ring of polynomials in F [T ] considered modulo h(T ), is...
متن کاملRoots of Irreducible Polynomials in Tame Henselian Extension Fields
A class of irreducible polynomials P over a valued field (F, v) is introduced, which is the set of all monic irreducible polynomials over F when (F, v) is maximally complete. A “best–possible” criterion is given for when the existence of an approximate root in a tamely ramified Henselian extension K of F to a polynomial f in P guarantees the existence of an exact root of f in K. §
متن کاملSparse univariate polynomials with many roots over finite fields
Suppose q is a prime power and f ∈ Fq[x] is a univariate polynomial with exactly t nonzero terms and degree <q−1. To establish a finite field analogue of Descartes’ Rule, Bi, Cheng and Rojas (2013) proved an upper bound of 2(q − 1) t−2 t−1 on the number of cosets in F∗ q needed to cover the roots of f in F∗ q . Here, we give explicit f with root structure approaching this bound: For q a t power...
متن کاملIterated constructions of irreducible polynomials over finite fields with linearly independent roots
The paper is devoted to constructive theory of synthesis of irreducible polynomials and irreducible N-polynomials (with linearly independent roots) over finite fields. For a suitably chosen initial N-polynomial F1ðxÞAF2s 1⁄2x of degree n; polynomials FkðxÞAF2s 1⁄2x of degrees 2 n are constructed by iteration of the transformation of variable x-x þ dx ; where dAF2s and da0: It is shown that the ...
متن کاملIrreducible polynomials with consecutive zero coefficients
Given an integer n > 1, it has been proved independently by S.D. Cohen [2] and R. Ree [13], that for all large enough q, there always is an irreducible polynomial over Fq of the form T +T +a. However, much less is known when q is fixed and n large. In [10], T. Hansen and G.L. Mullen conjecture that given integers n > m ≥ 0 there exists a monic irreducible polynomial over Fq of degree n with the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1994
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-68-1-85-88